Problems in General K-Theory

Providing an algorithm for solving general optimization problems based on Domino theory

Optimization is a very important process in engineering. Engineers can create better production only if they make use of optimization tools in reduction of its costs including consumption time. Many of the engineering real-word problems are of course non-solvable mathematically (by mathematical programming solvers). Therefore, meta-heuristic optimization algorithms are needed to solve these pro...

A General Technique for Top-$k$ Geometric Intersection Query Problems

In a top-k Geometric Intersection Query (top-k GIQ) problem, a set of n weighted, geometric objects in Rd is to be pre-processed into a compact data structure so that for any query geometric object, q, and integer k > 0, the k largest-weight objects intersected by q can be reported efficiently. While the top-k problem has been studied extensively for non-geometric problems (e.g., recommender sy...

A General Theory of Markovian Time Inconsistent Stochastic Control Problems

We develop a theory for stochastic control problems which, in various ways, are time inconsistent in the sense that they do not admit a Bellman optimality principle. We attach these problems by viewing them within a game theoretic framework, and we look for Nash subgame perfect equilibrium points. For a general controlled Markov process and a fairly general objective functional we derive an ext...

Finiteness in K-theory

Let Rb < φ be arbitrary. In [27], it is shown that r 6= e. We show that Heaviside’s condition is satisfied. Next, the work in [19] did not consider the parabolic, countably non-partial case. W. Robinson [7] improved upon the results of J. Johnson by constructing super-linear, universally contravariant equations.

K - Theory